Several Problems on the Heavy Oil Combustion
نویسندگان
چکیده
منابع مشابه
On the Complexity of Several Haplotyping Problems
In this paper we present a collection of results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequenced haplotype data. More specifically, we show that an interesting, restricted case of Minimum Error Correction (MEC) is NP-hard, point out problems in earlier claims about a related problem,...
متن کاملOil combustion and childhood cancers.
STUDY OBJECTIVES To identify specific toxic atmospheric emissions and their industrial sources in Great Britain. To link them with each other and with the birth addresses of children dying from cancer. To identify specific causal agents and sources. DESIGN Birth and death addresses of children dying from cancer were linked to emissions hotspots for specific chemicals: and to related source in...
متن کاملA Kinetic Investigation into the In Situ Combustion Reactions of Iranian Heavy Oil from Kuh-E-Mond Reservoir
An efficient design of in situ combustion depends on accurate kinetic modeling of the crude oil oxidation. The kinetic triplet of the oxidation reactions of a heavy oil sample was investigated. Once the kinetic triplet is known, the kinetic equation would be deconvolved. The crude oil sample was obtained from Kuh-E-Mond reservoir, located in the southwest of Iran. The samples were analyzed usin...
متن کاملOn Several Problems in Legal Transplantation
Legal transplantation, existing between nations and national districts, usually means the digestive and absorptive process happened in legal article, legal principle, legal system, legal norm, legal concept and technology, legal idea. It usually includes four aspects about its qualities. There have been two significant legal transplantations in Chinese history. Legal transplantation is an impor...
متن کاملOn Hardness of Several String Indexing Problems
Let D = {d1, d2, ..., dD} be a collection of D string documents of n characters in total. The two-pattern matching problems ask to index D for answering the following queries efficiently. – report/count the unique documents containing P1 and P2. – report/count the unique documents containing P1, but not P2. Here P1 and P2 represent input patterns of length p1 and p2 respectively. Linear space d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Fuel Society of Japan
سال: 1959
ISSN: 0369-3775,2185-226X
DOI: 10.3775/jie.38.7_438